A Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree
نویسندگان
چکیده
This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our approach minimizes the use of broadcast support by exploiting the distributed queue of token requests kept by the original algorithm. It also provides good fairness since, during failure recovery, it tries to preserve the order in which token requests would have been satisfied had the failure not occurred.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Fault Tolerant Token-based Algorithm for Group Mutual Exclusion in Distributed Systems
The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the present paper a token-based group mutual exclusion algorithm, capable of handling transient faults, is proposed. The algorithm uses the concept of dynamic request sets. A time out mechanism is used to detect the token loss; also, a distributed scheme is used to regenerate the token. The worst case mess...
متن کاملA O(log2 n) Fault-Tolerant Distributed Mutual Exclusion Algorithm Based on Open-Cube Structure
A new distributed mutual exclusion algorithm, using a token and based upon an original rooted tree structure, is presented. The rooted tree introduced. named “open-cube“ , has noteworthy stability and locality properties, allowing the proposed algorithm to achieve good perfotmances and high tolerance to node failures: the worst case message complexity per request is, in the absence of node fail...
متن کاملA Fault-tolerant Mutual Exclusion Algorithm in Asynchronous Distributed Systems
Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In ...
متن کاملA Token Based Protocol for Mutual Exclusion in Mobile Ad Hoc Networks
Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clu...
متن کامل